Playing by searching: two strategies against a linearly bounded liar
نویسنده
چکیده
منابع مشابه
Linearly bounded liars, adaptive covering codes, and deterministic random walks
We analyze a deterministic form of the random walk on the integer line called the liar machine, similar to the rotor-router model, finding asymptotically tight pointwise and interval discrepancy bounds versus random walk. This provides an improvement in the best-known winning strategies in the binary symmetric pathological liar game with a linear fraction of responses allowed to be lies. Equiva...
متن کاملNoise tolerant algorithms for learning and searching
We consider the problem of developing robust algorithms which cope with noisy data. In the Probably Approximately Correct model of machine learning, we develop a general technique which allows nearly all PAC learning algorithms to be converted into highly e cient PAC learning algorithms which tolerate noise. In the eld of combinatorial algorithms, we develop techniques for constructing search a...
متن کاملAdaptive Regret Minimization in Bounded-Memory Games
Online learning algorithms that minimize regret provide strong guarantees in situations that involve repeatedly making decisions in an uncertain environment, e.g. a driver deciding what route to drive to work every day. While regret minimization has been extensively studied in repeated games, we study regret minimization for a richer class of games called bounded memory games. In each round of ...
متن کاملGene Regulation by the LiaSR Two-Component System in Streptococcus mutans
The LiaSR two-component signal transduction system regulates cellular responses to several environmental stresses, including those that induce cell envelope damages. Downstream regulons of the LiaSR system have been implicated in tolerance to acid, antibiotics and detergents. In the dental pathogen Streptococcus mutans, the LiaSR system is necessary for tolerance against acid, antibiotics, and ...
متن کاملROBUST RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH UNCERTAIN-BUT-BOUNDED ACTIVITY DURATIONS AND CASH FLOWS I. A NEW SAMPLING-BASED HYBRID PRIMARY-SECONDARY CRITERIA APPROACH
This paper, we presents a new primary-secondary-criteria scheduling model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations (UD) and cash flows (UC). The RCPSP-UD-UC approach producing a “robust” resource-feasible schedule immunized against uncertainties in the activity durations and which is on the sampling-based scenarios may be evaluated from a cos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 282 شماره
صفحات -
تاریخ انتشار 2002